for i in range(int(input())):
values=[]
s=input()
for k in range(8):
st=input()
values.append(st)
if "RRRRRRRR" in values:
print("R")
else:
j = 0
while j < 8 :
if values[0][j]==values[1][j] == values[2][j] == values[3][j] == values[4][j] == values[5][j] ==values[6][j] == values[7][j] == "B":
print("B")
break
j += 1
#include<iostream>
#include<string>
#include<cmath>
#include<set>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
using namespace std;
void solve() {
int cnt = 0;
string arr;
for (int i = 0; i < 8; i++) {
string arr; cin >> arr;
if (arr == "RRRRRRRR")
cnt++;
}
if (cnt >= 1) cout << "R" << endl;
else cout << "B" << endl;
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t = 1; cin >> t;
for (int x = 0; x < t; x++) {
solve();
}
return 0;
}
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |